An improved multi-objective optimization algorithm for solving flexible job shop scheduling problem with variable batches
نویسندگان
چکیده
In order to solve the flexible job shop scheduling problem with variable batches, we propose an improved multi-objective optimization algorithm, which combines idea of inverse scheduling. First, a batches model is formulated. Second, batch algorithm in size adjusted by dynamic feedback adjusting method. Moreover, increase diversity population, two methods are developed. One threshold control neighborhood updating, and other clustering update population. Finally, group experiments carried out. The results show that can ensure Pareto solutions effectively, has effective performance solving batches.
منابع مشابه
An algorithm for multi-objective job shop scheduling problem
Scheduling for job shop is very important in both fields of production management and combinatorial op-timization. However, it is quite difficult to achieve an optimal solution to this problem with traditional opti-mization approaches owing to the high computational complexity. The combination of several optimization criteria induces additional complexity and new problems. In this paper, we pro...
متن کاملSolving Flexible Job Shop Scheduling with Multi Objective Approach
In this paper flexible job-shop scheduling problem (FJSP) is studied in the case of optimizing different contradictory objectives consisting of: (1) minimizing makespan, (2) minimizing total workload, and (3) minimizing workload of the most loaded machine. As the problem belongs to the class of NP-Hard problems, a new hybrid genetic algorithm is proposed to obtain a large set of Pareto-optima...
متن کاملan algorithm for multi-objective job shop scheduling problem
scheduling for job shop is very important in both fields of production management and combinatorial op-timization. however, it is quite difficult to achieve an optimal solution to this problem with traditional opti-mization approaches owing to the high computational complexity. the combination of several optimization criteria induces additional complexity and new problems. in this paper, we pro...
متن کاملAn Improved Genetic Algorithm for Multi-objective Flexible Job-shop Scheduling Problem
Flexible job shop scheduling problem (FJSP) is an extended traditional job shop scheduling problem, which more approximates to real scheduling problems. This paper presents a multi-objective genetic algorithm (GA) based on immune and entropy principle to solve the multi-objective FJSP. In this improved multi-objective GA, the immune and entropy principle is used to keep the diversity of individ...
متن کاملAn effective hybrid particle swarm optimization algorithm for multi-objective flexible job-shop scheduling problem
0360-8352/$ see front matter 2008 Elsevier Ltd. A doi:10.1016/j.cie.2008.07.021 * Corresponding author. E-mail address: [email protected] (X. Shao). Flexible job-shop scheduling problem (FJSP) is an extension of the classical job-shop scheduling problem. Although the traditional optimization algorithms could obtain preferable results in solving the monoobjective FJSP. However, they are very d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Chinese Journal of Systems Engineering and Electronics
سال: 2021
ISSN: ['1004-4132']
DOI: https://doi.org/10.23919/jsee.2021.000024